La correspondance de Robinson-Schensted pour les tableaux oscillants gauches
نویسندگان
چکیده
We introduce an analog of the Robinson Schensted algorithm for skew oscillating tableaux which generalizes the well-known correspondence for standard tableaux. We show that this new algorithm enjoys some of the same properties as the original. In particular, it is still true that replacing a permutation by its inverse exchanges the two output tableaux. These facts permit us to derive a number of identities involving the number of such tableaux.
منابع مشابه
Bumping algorithm for set-valued shifted tableaux
We present an insertion algorithm of Robinson–Schensted type that applies to set-valued shifted Young tableaux. Our algorithm is a generalization of both set-valued non-shifted tableaux by Buch and non set-valued shifted tableaux by Worley and Sagan. As an application, we obtain a Pieri rule for a K-theoretic analogue of the Schur Q-functions. Résumé Nous présentons un algorithme d’insertion de...
متن کاملSemi-skyline augmented fillings and non-symmetric Cauchy kernels for stair-type shapes
Using an analogue of the Robinson-Schensted-Knuth (RSK) algorithm for semi-skyline augmented fillings, due to Sarah Mason, we exhibit expansions of non-symmetric Cauchy kernels ∏ (i,j)∈η(1 − xiyj) −1, where the product is over all cell-coordinates (i, j) of the stair-type partition shape η, consisting of the cells in a NW-SE diagonal of a rectangle diagram and below it, containing the biggest s...
متن کاملSigned Enumeration of Ribbon Tableaux with Local Rules and Generalizations of the Schensted Correspondence
Sergey Fomin defined the general framework of dual graded graphs that extends the classical Schensted correspondence to a much wider class of objects. His approach is both bijective and algebraic, the latter being inspired by the works of Stanley on differential posets. In this work we present an extension of Fomin’s work, through the signed enumeration of ribbon tableaux. We consider ribbons o...
متن کاملAlgebraic constructions on set partitions
The main contribution of this article is to provide a combinatorial Hopf algebra on set partitions, which can be seen as a Hopf subalgebra of the free quasi-symmetric functions, and which is free, cofree and self-dual. This algebraic construction comes naturally from a combinatorial algorithm, an analogous of the Robinson-Schensted correspondence on set partitions. This correspondence also give...
متن کاملRelating Edelman-Greene insertion to the Little map
The Little map and the Edelman-Greene insertion algorithm, a generalization of the Robinson-Schensted correspondence, are both used for enumerating the reduced decompositions of an element of the symmetric group. We show the Little map factors through Edelman-Greene insertion and establish new results about each map as a consequence. In particular, we resolve some conjectures of Lam and Little....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 139 شماره
صفحات -
تاریخ انتشار 1995